Efficient Occlusion Culling using Solid Occluders

نویسندگان

  • Georgios Papaioannou
  • Athanasios Gaitatzes
  • Dimitrios Christopoulos
چکیده

Occlusion culling is a genre of algorithms for rapidly eliminating portions of three-dimensional geometry hidden behind other, visible objects prior to passing them to the rendering pipeline. In this paper, an extension to the popular shadow frustum culling algorithm is presented, which takes into account the fact that many planar occluders can be grouped into compound convex solids, which in turn can provide fewer and larger culling frusta and therefore more efficient elimination of hidden geometry. The proposed method combines planar and solid occluders using a unified selection approach and is ideal for dynamic environments, as it doesn’t depend on pre-calculated visibility data. The solid occluders culling algorithm has been applied to commercially deployed virtual reality systems and test cases and results are provided from actual virtual reality shows.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Simplification for Efficient Occlusion Culling in Urban Scenes

Most occlusion culling algorithms select a subset of suitable occluder planes or geometries to exclude invisible objects from further visualization processing. Preferably these occluders are large and simple. For complex scenes it is worthwhile to generate virtual occluders to replace complex occluder geometries by simple polygonal structures. In urban scenes, the facade of buildings comprises ...

متن کامل

An Adaptive Hierarchical Occlusion Culling Algorithm for Interactive Large Model Visualization

This paper describes a new occlusion culling technique for efficient visibility determination in real-time environments. There are two major contributions of our work. First, we present an efficient algorithm to determine a set of potential occluders by sampling the virtual environment by sending rays from the camera into the view frustum. Thus, the set of potential occluders is always a subset...

متن کامل

E ective Occlusion Culling for the Interactive Display of Arbitrary Models

HANSONG ZHANG: E ective Occlusion Culling for the Interactive Display of Arbitrary Models. (Under the direction of Dinesh Manocha.) As an advanced form of visibility culling, occlusion culling detects hidden objects and prevents them from being rendered. An occlusion-culling algorithm that can e ectively accelerate interactive graphics must simultaneously satisfy the following criteria: General...

متن کامل

Occlusion Culling in Terrains based on automatically generated virtual Occluders

In this paper we present a computationally inexpensive way to perform Occlusion Culling in terrain scenes, modelled by elevation maps. The proposed method is based on virtual Occluders [Law99] (i.e. relatively simple structures, that are used to perform the actual visibility test). Unlike most of the related work, we did not seek for an accurate solution, but for a good conservative and inexpen...

متن کامل

Selecting Effective Occluders for Visibility Culling

This paper deals with the problem of identifying effective occluders for visibility culling. The solid-angle metric is commonly used for measuring the potential significance of occluders from a single viewpoint. In this paper, we show that it does not extend properly to from-region occlusion calculations. We propose to measure the effectiveness of an occluder by means of the size of its umbra. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005